• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

±¹³» ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ±¹³» ³í¹®Áö > Çѱ¹Á¤º¸°úÇÐȸ ³í¹®Áö > Á¤º¸°úÇÐȸ³í¹®Áö (Journal of KIISE)

Á¤º¸°úÇÐȸ³í¹®Áö (Journal of KIISE)

Current Result Document :

ÇѱÛÁ¦¸ñ(Korean Title) È¿À²ÀûÀÎ ºÐ»ê º¹ÇÕ À̺¥Æ® 󸮸¦ À§ÇÑ Å½¿åÀû ±ÔÄ¢ ºÐ¹è ¾Ë°í¸®Áò
¿µ¹®Á¦¸ñ(English Title) A Greedy Rule Allocation Algorithm for Efficient Distributed Complex Event Processing
ÀúÀÚ(Author) ½ÅÀ¯ÁÖ   ÀÌÀç±æ   Yooju Shin   Jae-Gil Lee  
¿ø¹®¼ö·Ïó(Citation) VOL 46 NO. 12 PP. 1222 ~ 1231 (2019. 12)
Çѱ۳»¿ë
(Korean Abstract)
º¹ÇÕ À̺¥Æ® ó¸® ½Ã½ºÅÛÀº ¿©·¯ ½ºÆ®¸² µ¥ÀÌÅ͸¦ ½Ç½Ã°£À¸·Î ¹Þ¾Æ À¯ÀǹÌÇÑ º¹ÀâÇÑ »óȲÀ» À̺¥Æ® ±ÔÄ¢À̳ª ÁúÀÇ, ¿¬»êÀ¸·Î ã¾Æ³»°í ºÐ¼®ÇÏ´Â ½Ã½ºÅÛÀ» ¸»ÇÑ´Ù. ½Ç½Ã°£À¸·Î µé¾î¿À´Â µ¥ÀÌÅ;çÀÌ Áõ°¡ÇÏ°Ô µÇ¸é ¿©·¯ ½ºÆ®¸² µ¥ÀÌÅÍ¿Í À̺¥Æ® ±ÔÄ¢À» ¿©·¯ ´ëÀÇ ¼­¹ö¿¡ ºÐ¹èÇØ Ã³¸®ÇÏ°Ô µÈ´Ù. ÇÏÁö¸¸ °¢ ¼­¹ö¿¡ °¡ÇØÁú ºÎÇÏ¿¡ ´ëÇÑ °í·Á ¾øÀÌ ½ºÆ®¸² µ¥ÀÌÅÍ¿Í À̺¥Æ® ±ÔÄ¢À» ºÐ¹èÇÏ°Ô µÇ¸é ½ºÆ®¸² µ¥ÀÌÅÍ°¡ °úµµÇÏ°Ô º¹Á¦µÇ¾î ³×Æ®¿öÅ© ÀÔÃâ·Â¿¡ ºÎÇϸ¦ ÁÖ°í ºÐ¹èµÈ À̺¥Æ® ±ÔÄ¢°ú ½ºÆ®¸² µ¥ÀÌÅ͸¦ ¸ÂÃ纸´Â ½Ã°£ÀÌ Áõ°¡ÇÏ°Ô µÈ´Ù. º» ³í¹®¿¡¼­´Â À̸¦ ¸·±â À§ÇØ È¿À²ÀûÀÎ ½ºÆ®¸² µ¥ÀÌÅÍ ºû À̺¥Æ® ±ÔÄ¢ ºÐ¹è ¾Ë°í¸®ÁòÀ» Á¦¾ÈÇÑ´Ù. ÀÌ ¾Ë°í¸®ÁòÀº À̺¥Æ® ±ÔÄ¢¿¡ Á¡¼ö¸¦ ºÎ¿©ÇÏ°í Á¡¼ö°¡ Å« ¼ø¼­´ë·Î À̺¥Æ® ±ÔÄ¢À» Á¤·ÄÇÑ´Ù. ºÐ¹è ½Ã¿¡´Â ÁÖ¾îÁø Àüü ºÎÇÏ ÇÔ¼ý°ªÀ» °¡Àå ÀÛ°Ô Áõ°¡½ÃÅ°´Â ¼­¹ö¿¡ °¢ À̺¥Æ® ±ÔÄ¢À» Á¤·ÄµÈ ¼ø¼­´ë·Î Çϳª¾¿ ºÐ¹èÇÑ´Ù. Á¦¾ÈÇÑ ¾Ë°í¸®ÁòÀº ÃÖÀûÈ­ °ËÁõ°ú ¼º´É ½ÇÇèÀ» ÅëÇØ ±× ¿ì¼ö¼ºÀ» º¸¿´´Ù. ÃÖÀûÈ­ °ËÁõ¿¡¼­´Â ÇÕ¼º µ¥ÀÌÅ͸¦ ÀÌ¿ëÇØ ÀÌ ¾Ë°í¸®ÁòÀÌ ´Ù¸¥ ¾Ë°í¸®Áò¿¡ ºñÇØ ÃÖÀûÀÇ ºÐ¹è °á°ú¿¡ °¡Àå °¡±õ´Ù´Â °ÍÀ» º¸ÀδÙ. ¼º´É ½ÇÇè¿¡¼­´Â ½ÇÁ¦ µ¥ÀÌÅÍ¿Í À̺¥Æ® ±ÔÄ¢À» »ç¿ëÇÑ ºÐ»ê º¹ÇÕ À̺¥Æ® ó¸® ½Ã½ºÅÛ¿¡¼­ º¹Á¦À²°ú Áö¿¬½Ã°£À» ´Ù¸¥ ´ë¾È ¾Ë°í¸®Áò°ú ºñ±³ÇØ Á¦¾ÈÇÑ ¾Ë°í¸®ÁòÀÇ ¼º´É ¿ìÀ§¸¦ ÀÔÁõÇß´Ù.
¿µ¹®³»¿ë
(English Abstract)
Complex event processing (CEP) is defined as event processing for multiple stream sources to infer events that suggest complicated circumstances. As the size of stream data becomes larger, CEP engines have been parallelized to benefit from distributed computing. However, distributed CEP could duplicate redundant stream data and increase latency without consideration about the computational cost on each engine after the allocation of stream data and CEP rules. In this paper, we suggest an efficient rule allocation algorithm to prevent such situations. This algorithm determines event rules priorities for the allocation, wherein the rule with higher priority is allocated first to the engine that minimizes the increase of the value of the proposed cost function. We prove the superiority of our algorithm in two tests. In the optimization verification test, our algorithm achieves the results closest to the optimal results compared with the other algorithms. In the performance test, our algorithm shows lower latency and data replication ratio in the distributed CEP system using real world dataset and event rules.
Å°¿öµå(Keyword) º¹ÇÕ À̺¥Æ® 󸮠  ½ºÆ®¸² µ¥ÀÌÅÍ Ã³¸®   ±ÔÄ¢ ºÐ¹è   complex event processing   stream data processing   rule allocation  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå